CrossRef Search
نویسندگان
چکیده
منابع مشابه
CrossRef and SFX: complementary linking services for libraries
With the increase in the use of electronic information services in libraries, and in particular with the dramatic increase in the use of electronic journals, there is an urgent need by libraries for solutions that link the disparate information resources in a meaningful way for the end user and that optimize the use of these resources. Such linking solutions are now available for libraries, sup...
متن کاملUse of CrossRef and OAI-PMH to Enrich Bibliographical Databases
Introduction Today prominent and comprehensive databases such as Thomson Reuters’ Web of Science (WoS) or Elsevier’s Scopus are highly in use for bibliometric research. However, these databases do not index full texts hindering researchers to carry out more detailed analyses. Besides, it is possible that some indexed publications do not have DOI numbers playing an important role to access full ...
متن کاملNurse and Internet search
زمان لازم برای کسب مهارت در بکارگیری اطلاع رسانی از ضروریات دنیای امروز و لازمه اینترنت، کار و فعالیت موثر در اجتماع است . این امر به گروه تخصصی خاصی محدود نمی باشد و هیچ گروه اجتماعی، اقتصادی و فرهنگی نمی تواند خود را از این قاعده مستثنی بداند. از این رو اینترنت، گسترده ترین شبکه اطلاع رسانی، روزبروز بیشتر مورد استفاده قرار می گیرد.
متن کاملSYMBIOTIC ORGANISMS SEARCH AND HARMONY SEARCH ALGORITHMS FOR DISCRETE OPTIMIZATION OF STRUCTURES
In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap i...
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Serials: The Journal for the Serials Community
سال: 2004
ISSN: 0953-0460
DOI: 10.1629/17291